Parallel algorithms for relational coarsest partition problems
نویسندگان
چکیده
منابع مشابه
Parallel Algorithms for Relational Coarsest Partition Problems
Relational Coarsest Partition Problems (RCPPs) play a vital role in verifying concurrent systems. It is known that RCPPS are Ρ-complete and hence it may not be possible to design polylog time parallel algorithms for these problems. In this paper, we present two efficient parallel algorithms for RCPP, in which its associated label transition system is assumed to have m transitions and n states. ...
متن کاملA Parallel Algorithm for Relational Coarsest Partition Problems and Its Implementation
Relational Coarsest Partition Problems (RCPPs) play a vital role in verifying concurrent systems. It is known that RCPPs are P-complete and hence it may not be possible to design polylog time parallel algorithms for these problems. In this paper, we present a parallel algorithm for RCPP, in which its associated label transition system is assumed to have m transitions and n states. This algorith...
متن کاملSimulation as Coarsest Partition Problem
The problem of determining the coarsest partition stable with respect to a given binary relation, is known to be equivalent to the problem of finding the maximal bisimulation on a given structure. Such an equivalence has suggested efficient algorithms for the computation of the maximal bisimulation relation. In this paper the simulation problem is rewritten in terms of coarsest stable partition...
متن کاملOn O(n log n) Cost Parallel Algorithm for the Single Function Coarsest Partition Problem
Robert Paige New York University Dept. of Computer Science New York City NY 10012 An algorithm on a CRCW PRAM for computing the coarsest refinement of a partition of a finite set S with respect to a function! over S is presented here. It requires 0 (n) processors, o(n logn) space. and 0 (logn) time in the worst case.
متن کاملSimple Algorithms for Graph Partition Problems
Based on the Belief Propagation Method, we propose simple and deterministic algorithms for some NP-hard graph partitioning problems, such as the Most Likely Partition problem and the Graph Bisection problem. These algorithms run in O(n+m) or O((n+m) log n) time on graphs with n vertices and m edges. For their average case analysis, we consider the planted solution model and prove that they yiel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Parallel and Distributed Systems
سال: 1998
ISSN: 1045-9219
DOI: 10.1109/71.707548